Linear BSP Tree in the Plane for Set of Segments with Low Directional Density
نویسندگان
چکیده
We introduce a new BSP tree construction method for set of segments in the plane. Our algorithm is able to create BSP tree of linear size in the time O(n log n) for set of segments with low directional density (i.e. it holds for arbitrary segment si from such set, that a line created as extension of this segment doesn’t intersect too many other segments from the set in a near neighbourhood of si) and a directional constant δ belonging to this set. keywords: BSP, segment, tree, partitioning
منابع مشابه
Linear BSP Tree in the Plane for Set of Segmentswith Low Directional
We introduce a new BSP tree construction method for set of segments in the plane. Our algorithm is able to create BSP tree of linear size in the time O(n log 3 n) for set of segments with low directional density (i.e. it holds for arbitrary segment s i from such set, that a line created as extension of this segment doesn't intersect too many other segments from the set in a near neighbourhood o...
متن کاملLinear BSP Trees for Sets of Hyperrectangles with Low Directional Density
We consider the problem of constructing of binary space partitions (BSP) for a set S of n hyperrectangles in arbitrary dimensional space. If the set S fulfills the low directional density condition defined in this paper then the resultant BSP has O(n) size and it can be constructed in O(n log n) time in R. The low directional density condition defines a new class of objects which we are able to...
متن کاملApproximate Range Searching Using Binary Space Partitions
We show how any BSP tree TP for the endpoints of a set of n disjoint segments in the plane can be used to obtain a BSP tree of size O(n · depth(TP )) for the segments themselves, such that the range-searching efficiency remains almost the same. We apply this technique to obtain a BSP tree of size O(n log n) such that ε-approximate range searching queries with any constant-complexity convex quer...
متن کاملLinear BSP Trees for Sets of Hyperrectangleswith Low Directional
We consider the problem of constructing of binary space partitions (BSP) for a set S of n hyperrectangles in arbitrary dimensional space. If the set S fulllls the low directional density condition deened in this paper then the resultant BSP has O(n) size and it can be constructed in O(n log 2 n) time in R 3. The low directional density condition deenes a new class of objects which we are able t...
متن کاملTexture Evolution in Low Carbon Steel Fabricated by Multi-directional Forging of the Martensite Starting Structuree
It has been clarified that deformation and annealing of martensite starting structure can produce ultrafine-grained structure in low carbon steel. This study aims to investigate the texture evolution and mechanical properties of samples with martensite structure deformed by two different forging processes. The martensitic steel samples were forged by plane strain compression and multi-directio...
متن کامل